An Asynchronous Parallel Algorithm for Undirected Graph Connectivity

Parallel Strong Orientation of an Undirected Graph

An Adaptive Parallel Algorithm for Computing Connectivity

Computing connected components in undirected graphs is a fundamental problem in graph analytics. The size of graph data collections continues to grow in many different scientific domains, which motivates the need for high performance distributed memory parallel graph algorithms, especially for large networks that cannot fit into the memory of a single compute node. For a graph G(V,E) with n ver...

Parallel and fast sequential algorithms for undirected edge connectivity augmentation

In the edge connectivity augmentation problem one wants to find an edge set of minimum total capacity that increases the edge connectivity of a given undirected graph by τ . It is a known non-trivial property of the edge connectivity augmentation problem that there is a sequence of edge sets E1, E2, . . . , such that ⋃ i≤τ Ei optmially increases the connectivity by τ , for any integer τ . The m...

An Asynchronous Parallel Differential Evolution Algorithm

A Parallel Differential Evolution algorithm is presented in this work, developed for a cluster of computers in Windows environment. The parallelization is realized using an asynchronous approach, utilizing a Master-Slave architecture. A separate executable program is used to evolve each member of the population. The current population is stored in a folder accessible by all executables; each cu...

An Asynchronous Parallel Stochastic Coordinate Descent Algorithm

We describe an asynchronous parallel stochastic coordinate descent algorithm for minimizing smooth unconstrained or separably constrained functions. The method achieves a linear convergence rate on functions that satisfy an essential strong convexity property and a sublinear rate (1/K) on general convex functions. Near-linear speedup on a multicore system can be expected if the number of proces...